A Viewpoint on the Decoding of the Quadratic Residue Code of Length 89
نویسنده
چکیده
A viewpoint on the weight-6 error patterns of the algebraic decoding of the (89, 45, 17) quadratic residue (QR) code with reducible generator polynomial, proposed by Truong et al. (2008), is presented in this paper. Some weight-6 error patterns will cause a zero value in the syndrome S1. However, in this case, the inverse-free Berlekamp-Massey (IFBM) algorithm is still valid to determine the error-locator polynomial of six errors in the finite field GF(2). An example dem-
منابع مشابه
Decoding the (89, 45, 17) Quadratic Residue Code
In this paper, a modification decoding algorithm for the (89, 45, 17) QR code is proposed to decode all error patterns with weight less than six and high percentage weight-6, weight-7, and weight-8 error patterns.
متن کاملHigh speed decoding of the binary (47, 24, 11) quadratic residue code
An efficient table lookup decoding algorithm (TLDA) is presented to decode up to five possible errors in a binary systematic (47,24,11) quadratic residue (QR) code. The main idea of the TLDA is based on the weight of syndrome, the syndrome decoder together with a reduced-size lookup table (RSLT), and the shift-search method given by Reed et al. Thus, the size of the lookup table and computation...
متن کاملDecoding the Ternary (23, 11, 9) Quadratic Residue Code
Quadratic residue (QR) codes are cyclic, nominally half-rate codes, that are powerful with respect to their error-correction capabilities. Decoding QR codes is in general a difficult task, but great progress has been made in the binary case since the work of Elia [1] and He et al. [2]. Decoding algorithms for certain nonbinary QR codes were proposed by Higgs and Humphreys in [3] and [4]. In [5]...
متن کاملOn the Pless Construction and ML Decoding of the Quadratic Residue Code
We present a method for maximumlikelihood decoding of the quadratic residue code This method is based on projecting the code onto a subcode with an acyclic Tanner graph and representing the set of coset leaders by a trellis diagram This results in a two level coset decoding which can be considered a systematic generalization of the Wagner rule We show that unlike the Golay code the code does no...
متن کاملDecoding the (41, 21, 9) Quadratic Residue Code
This paper proposes an algebraic decoding algorithm for the (41, 21, 9) quadratic residue code via Lagrange interpolation formula to determine error check and error locator polynomials. Programs written in C++ language have been executed to check every possible error pattern of this quadratic residue code.
متن کامل